Parameterized Complexity and Approximation Algorithms
نویسنده
چکیده
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for covering and packing problems in imageprocessing and VLSI. J. ACM, 32, 130–136. [115] Deng, X., Li, G., Li, Z., Ma, B. and Wang, L. (2002) A PTASfor distinguishing (sub)string selection. ICALP 02: Proc. 29thInt. Colloquium on Automata, Languages and Programming,Lecture Notes in Computer Science, Vol. 2380, pp. 740–751. Springer, Berlin. [116] Gramm, J., Guo, J. and Niedermeier, R. (2003) On exact andapproximation algorithms for distinguishing substringselection. Proc. Fundamentals of Computation Theory,Lecture Notes in Computer Science, Vol. 2751, pp. 195–209. Springer, Berlin.PARAMETERIZED COMPLEXITY AND APPROXIMATION ALGORITHMSPage 19 of 19 THE COMPUTER JOURNAL, 2007
منابع مشابه
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to o...
متن کاملApproximation Algorithms Inspired by Kernelization Methods
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to o...
متن کاملParameterized Approximation Problems
Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis. Up until now, most of the work in the area has focussed on exact algorithms for decision problems. The goal of the present paper is to apply parameterized ideas to approximation. We begin exploration of parameterized approximation problems, where the problem in question ...
متن کاملParameterized Complexity: The Main Ideas and Connections to Practical Computing
The purposes of this paper are two: (1) To give an exposition of the main ideas of parameterized complexity, (2) To discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms.
متن کاملApplications of Parameterized Computation in Computational Biology
This paper first gives an introduction to parameterized computation and complexity theory, a new subfield in theoretical computer science. Then it presents a summary of its applications to addressing some important NP-hard problems in computational biology. Specifically, we can design efficient parameterized algorithms and also drive computational lower bounds for the parameterized algorithms a...
متن کاملMaximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover
The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution can be very large, rendering algorithms parameterized by it inefficient. Therefore, we suggest to study the parameterized complexity of maximization problems with respect to the size of the optimal solutions to their...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 51 شماره
صفحات -
تاریخ انتشار 2008